Discontinuities and hysteresis in quantized average consensus
نویسندگان
چکیده
منابع مشابه
Discontinuities and hysteresis in quantized average consensus
We consider continuous-time average consensus dynamics in which the agents’ states are communicated through uniform quantizers. Solutions to the resulting system are defined in the Krasowskii sense and are proven to converge to conditions of “practical consensus”. To cope with undesired chattering phenomena we introduce a hysteretic quantizer, and we study the convergence properties of the resu...
متن کاملAverage consensus on networks with quantized communication
This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well-known linear diffusion algorithm, we propose a simple and effective adaptation which is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The ...
متن کاملQuantized Average Consensus on Gossip Digraphs with Reduced Computation
The authors have recently proposed a class of randomized gossip algorithms which solve the distributed averaging problem on directed graphs, with the constraint that each node has an integer-valued state. The essence of this algorithm is to maintain local records, called “surplus”, of individual state updates, thereby achieving quantized average consensus even though the state sum of all nodes ...
متن کاملQuantized consensus in Hamiltonian graphs
The main contribution of this paper is an algorithm to solve an extended version of the quantized consensus problem over networks represented by Hamiltonian graphs, i.e., graphs containing a Hamiltonian cycle, which we assume to be known in advance. Given a network of agents, we assume that a certain number of tokens should be assigned to the agents, so that the total number of tokens weighted ...
متن کاملA probabilistic analysis of the average consensus algorithm with quantized communication
In the average consensus problem the states of a set of agents, linked according to a directed graph, have to be driven to their average. When the communication between neighbors is uniformly quantized, such a problem can not be exactly solved by a linear time-invariant algorithm. In this work, we propose a probabilistic estimate of the error from the agreement, in terms of the eigenvalues of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2011
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2011.06.020